Flexible Job Shop Scheduling Problem Using an Improved Ant Colony Optimization
نویسندگان
چکیده
منابع مشابه
An ant colony optimization algorithm for job shop scheduling problem
The nature has inspired several metaheuristics, outstanding among these is Ant Colony Optimization (ACO), which have proved to be very effective and efficient in problems of high complexity (NP-hard) in combinatorial optimization. This paper describes the implementation of an ACO model algorithm known as Elitist Ant System (EAS), applied to a combinatorial optimization problem called Job Shop S...
متن کاملAnt Colony Optimization for Job Shop Scheduling Problem
This paper presents an application of the Ant colony optimization metaheuristic to the job shop scheduling problem. A pheromone alteration strategy which improves the basic ant system by utilizing the behaviour of artificial ants to perform local search is introduced. Experiments using well-known benchmark JSSP problems show that this approach improves on the performance obtained by the basic a...
متن کاملAn Ant Colony Optimization algorithm for Flexible Job shop scheduling problem
Scheduling involves the allocation of resources over a period of time to perform a collection of tasks (Baker, 1974). It is a decision-making process that plays an important role in most manufacturing and service industries (Pinedo, 2005). Scheduling in the context of manufacturing systems refers to the determination of the sequence in which jobs are to be processed over the production stages, ...
متن کاملAn improved ant colony algorithm for the Job Shop Scheduling Problem
Instances of static scheduling problems can be easily represented as graphs where each node represents a particular operation. This property makes the Ant Colony Algorithms well suited for different kinds of scheduling problems. In this paper we present an improved Ant System for solving the Job Shop Scheduling (JSS) Problem. After each cycle the Ant System applies a scheduler builder to each s...
متن کاملImplementation of an Ant Colony Optimization technique for job shop scheduling problem
Research on optimization of the job shop scheduling problem (JSP) is one of the most significant and promising areas of optimization. Instead of the traditional optimization method, this paper presents an investigation into the use of an Ant Colony System (ACS) to optimize the JSP. The main characteristics of this system are positive feedback, distributed computation, robustness and the use of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 2017
ISSN: 1058-9244,1875-919X
DOI: 10.1155/2017/9016303